Matching in the Pi-Calculus
نویسندگان
چکیده
منابع مشابه
Matching in the Pi-Calculus
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...
متن کاملMatching in the Pi-Calculus (Technical Report)
We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...
متن کاملSession-based Type Discipline for Pi Calculus with Matching
does not allow the transmission of an arbitrary channel. In most situations a receiving process k?(k′′).Q can be alpha-converted ahead of communication so that the bound channel k′′ syntactically matches the free channel k′ in the object of the sending process [11]. The exception happens exactly when k′ is free in Q: alpha-conversion becomes impossible (for it would capture the free variable k′...
متن کاملThe pi-calculus
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملThe Attributed Pi Calculus
The attributed pi calculus (π(L)) forms an extension of the pi calculus with attributed processes and attribute dependent synchronization. To ensure flexibility, the calculus is parametrized with the language L which defines possible values of attributes. π(L) can express polyadic synchronization as in pi@ and thus diverse compartment organizations. A non-deterministic and a stochastic semantic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.160.3